翻訳と辞書
Words near each other
・ Longford Slashers
・ Longford Town F.C.
・ Longford, Coventry
・ Longford, Derbyshire
・ Longford, Gloucester
・ Longford, Kansas
・ Longford, London
・ Longford, Market Drayton
・ Longford, Newport
・ Longford, Tasmania
・ Longford, U.S. Virgin Islands
・ Longford, Victoria
・ Longford, Warrington
・ Longest recorded sniper kills
・ Longest reigning heavyweight champions
Longest repeated substring problem
・ Longest rivers of the United Kingdom
・ Longest squash match records
・ Longest tennis match records
・ Longest tiebreaker in tennis
・ Longest train services
・ Longest trains
・ Longest uncrossed knight's path
・ Longest word in English
・ Longest word in Spanish
・ Longest word in Turkish
・ Longest words
・ Longest Year (EP)
・ Longest-lasting light bulbs
・ Longetia


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

Longest repeated substring problem : ウィキペディア英語版
Longest repeated substring problem
In computer science, the longest repeated substring problem is the problem of finding the longest substring of a string that occurs at least twice. This problem can be solved in linear time and space by building a suffix tree for the string, and finding the deepest internal node in the tree. Depth is measured by the number of characters traversed from the root. The string spelled by the edges from the root to such a node is a longest repeated substring. The problem of finding the longest substring with at least k occurrences can be solved by first preprocessing the tree to count the number of leaf descendants for each internal node, and then finding the deepest node with at least k leaf descendants that have no children. In the figure with the string "ATCGATCGA$", the longest repeated substring is "ATCGA", and repeats twice.
== External links ==

*
* (C implementation of Longest Repeated Substring using Suffix Tree )


抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「Longest repeated substring problem」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.